Canonical correlations associated with symmetric reflexive generalized inverses of the dispersion matrix

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

Iterative algorithm for the generalized ‎$‎(P‎,‎Q)‎$‎-reflexive solution of a‎ ‎quaternion matrix equation with ‎$‎j‎$‎-conjugate of the unknowns

In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

متن کامل

On generalized inverses of singular matrix pencils

Linear time-invariant networks are modelled by linear differential-algebraic equations with constant coefficients. These equations can be represented by a matrix pencil. Many publications on this subject are restricted to regular matrix pencils. In particular, the influence of the Weierstrass structure of a regular pencil on the poles of its inverse is well known. In this paper we investigate s...

متن کامل

Generalized inverses of a normal matrix

The expressions for generalized inverses of a normal matrix are discussed by its Schur decomposition.

متن کامل

Graph Embeddings, Symmetric Real Matrices, and Generalized Inverses

Graph embedding techniques for bounding eigenvalues of associated matrices have a wide range of applications. The bounds produced by these techniques are not in general tight, however, and may be off by a log n factor for some graphs. Guattery and Miller showed that, by adding edge directions to the graph representation, they could construct an embedding called the current flow embedding, which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1992

ISSN: 0024-3795

DOI: 10.1016/0024-3795(92)90210-2